An implicit Q-theorem for Hessenberg-like matrices

نویسندگان

  • Raf Vandebril
  • Marc Van Barel
  • Nicola Mastronardi
چکیده

The implicit Q-theorem for Hessenberg matrices is a widespread and powerful theorem. It is used in the development of for example implicit QR-algorithms to compute the eigendecomposition of Hessenberg matrices. Moreover it can also be used to prove the essential uniqueness of orthogonal similarity transformations of matrices to Hessenberg form. The theorem is also valid for symmetric tridiagonal matrices, proving thereby also in the symmetric case its power. Currently there is a growing interest to so-called semiseparable matrices. These matrices can be considered as the inverses of tridiagonal matrices. In a similar way, one can consider Hessenberg-like matrices as the inverses of Hessenberg matrices. In this paper, we formulate and prove an implicit Q-theorem for Hessenberg-like matrices. Similarly, like in the Hessenberg case the notion of unreduced Hessenberglike matrices is introduced and also a method for transforming matrices via orthogonal transformations to this form is proposed. Moreover, as the theorem is valid for Hessenberg-like matrices it is also valid for symmetric semiseparable matrices.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new iteration for computing the eigenvalues of semiseparable (plus diagonal) matrices

This paper proposes a new type of iteration based on a structured rank factorization for computing eigenvalues of semiseparable and semiseparable plus diagonal matrices. Also the case of higher order semiseparability ranks is included. More precisely, instead of the traditional QR-iteration, a QH-iteration will be used. The QH-factorization is characterized by a unitary matrix Q and a Hessenber...

متن کامل

Chasing bulges or rotations? A new family of matrices admitting linear time QR-steps

The QR-algorithm is a renowned method for computing all eigenvalues of an arbitrary matrix. A preliminary unitary similarity transformation to Hessenberg form is indispensable for keeping the computational complexity of the subsequent QR-steps under control. In this paper, a whole new family of matrices, sharing the major qualities of Hessenberg matrices, will be put forward. This gives rise to...

متن کامل

QR-type iterations for eigenvalue computations based on factorizations of unitary matrices in rotations

The QR-algorithm is a renowned method for computing all eigenvalues of an arbitrary matrix. A preliminary unitary similarity transformation to Hessenberg form is indispensible for keeping the computational complexity of the QRalgorithm applied on the resulting Hessenberg matrix under control. The unitary factor Q in the QR-factorization of the Hessenberg matrix H = QR is composed of n − 1 rotat...

متن کامل

An Extension of the Qz Algorithm beyond the Hessenberg-upper Triangular Pencil

Recently, an extension of the class of matrices admitting a Francis type of multishift QR algorithm was proposed by the authors. These so-called condensed matrices admit a storage cost identical to that of the Hessenberg matrix and share all of the properties essential for the development of an effective implicit QR type method. This article continues along this trajectory by discussing the gen...

متن کامل

Implicit double shift QR-algorithm for companion matrices

In this paper an implicit (double) shifted QR-method for computing the eigenvalues of companion and fellow matrices will be presented. Companion and fellow matrices are Hessenberg matrices, that can be decomposed into the sum of a unitary and a rank 1 matrix. The Hessenberg, the unitary as well as the rank 1 structures are preserved under a step of the QR-method. This makes these matrices suita...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004